Elimination techniques: from extrapolation to totally positive matrices and CAGD

نویسنده

  • M. Gasca
چکیده

In this survey, we will show some connections between several mathematical problems such as extrapolation, linear systems, totally positive matrices and computer-aided geometric design, with elimination techniques as the common tool to deal with all of them. c © 2000 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A collection of examples where Neville elimination outperforms Gaussian elimination

Neville elimination is an elimination procedure alternative to Gaussian elimination. It is very useful when dealing with totally positive matrices, for which nice stability results are known. Here we include examples, most of them test matrices used in MATLAB which are not totally positive matrices, where Neville elimination outperforms Gaussian elimination. 2010 Elsevier Inc. All rights reserved.

متن کامل

Ela Bidiagonal Decompositions, Minors and Applications

Abstract. Matrices, called ε-BD matrices, that have a bidiagonal decomposition satisfying some sign constraints are analyzed. The ε-BD matrices include all nonsingular totally positive matrices, as well as their matrices opposite in sign and their inverses. The signs of minors of ε-BD matrices are analyzed. The zero patterns of ε-BD matrices and their triangular factors are studied and applied ...

متن کامل

On Factorizations of Totally Positive Matrices

Different approaches to the decomposition of a nonsingular totally positive matrix as a product of bidiagonal matrices are studied. Special attention is paid to the interpretation of the factorization in terms of the Neville elimination process of the matrix and in terms of corner cutting algorithms of Computer Aided Geometric Design. Conditions of uniqueness for the decomposition are also given.

متن کامل

A PLU-factorization of rectangular matrices by the Neville elimination

In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...

متن کامل

De Casteljau's algorithm is an extrapolation method

One of the most important recursive schemes in CAGD is De Casteljau's algorithm for the evaluation of Btzier curves and surfaces. Within the theory of triangular recursive schemes we discuss the De Casteljau's algorithm as a particular case, i.e. we prove that it is identical to the E-algorithm (or GNA-algorithm) in a particular frame. This result is of theoretical interest since it leads to so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000